RISC-CLP(CF) Constraint Logic Programming over Complex Functions
نویسنده
چکیده
A constraint logic programming system for the domain of complex functions is described. The intended users of the language are scientist and engineers who often reason/compute with constraints over complex functions, such as functional equalities, diierential equations, etc. Constraints are solved by iterating several solving methods such as Laplace transformation, non-linear equation solving, etc. A prototype has been built and is illustrated in the paper.
منابع مشابه
Clp(cf) Constraint Logic Programming over Complex Functions ?
A constraint logic programming system for the domain of complex functions is described. The intended users of the language are scientist and engineers who often reason/compute with constraints over complex functions, such as functional equalities, diierential equations, etc. Constraints are solved by iterating several solving methods such as Laplace transformation, non-linear equation solving, ...
متن کاملExtending RISC-CLP (Real) to Handle Symbolic Functions
In the previous version of the constraint logic programming language RISC-CLP(Real), the domain Real of real numbers was the intended domain of computation. In this paper, we extend it to the domain TreesReal of nite symbolic trees with real numbers as leaves, that is the integration of the domain of reals with the domain of nite Her-brand trees. In the extended language, a system of constraint...
متن کاملA Constraint Logic Programming Systemwith Parametric Domain
Current implementations of constraint logic programming languages (like CLP(<), CHIP or RISC-CLP(Real) support constraint solving over a certain xed domain. In this paper a system is presented which gives the possibility to instantiate a constraint logic programming language with an arbitrary constraint domain. The interface between the system and such a constraint domain is given and the exten...
متن کاملMax-planck-institut F ¨ Ur Informatik Analysis of Nonlinear Constraints in Clp(r) I N F O R M a T I K Author's Address
Solving nonlinear constraints over real numbers is a complex problem. Hence constraint logic programming languages like CLP(R) or Prolog III solve only linear constraints and delay nonlinear constraints until they become linear. This efficient implementation method has the disadvantage that sometimes computed answers are unsatisfiable or infinite loops occur due to the unsatisfiability of delay...
متن کاملClp() for Automatically Proving Program Properties 1
Various proof methods have been proposed to solve the implication problem , i.e. proving that properties of the form : 8(P ! Q)-where P and Q denote conjunctions of atoms-are logical consequences of logic programs. Nonetheless, it is a commonplace to say that it is still quite a diicult problem. Besides, the advent of the constraint logic programming scheme constitutes not only a major step tow...
متن کامل